Independent Set in P5-Free Graphs in Polynomial Time
نویسندگان
چکیده
The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, and there has been a long list of results showing that the problem becomes polynomial time solvable on sub-classes of P5-free graphs. In this paper we give the first polynomial time algorithm for Independent Set on P5-free graphs. Our algorithm also works for the Weighted Independent Set problem.
منابع مشابه
New Polynomial Case for Efficient Domination in P 6-free Graphs
In a graph G, an efficient dominating set is a subset D of vertices such that D is an independent set and each vertex outside D has exactly one neighbor in D. The Efficient Dominating Set problem (EDS) asks for the existence of an efficient dominating set in a given graph G. The EDS is known to be NP -complete for P7-free graphs, and is known to be polynomial time solvable for P5-free graphs. H...
متن کاملMaximum Weight Independent Sets for (, triangle)-free graphs in polynomial time
The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; it is well known to be NP-complete, and it remains NP-complete even under various strong restrictions such as for trianglefree graphs. Its compl...
متن کاملWeighted Efficient Domination for P5-Free Graphs in Linear Time
In a finite undirected graph G = (V,E), a vertex v ∈ V dominates itself and its neighbors. A vertex set D ⊆ V in G is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete for P7-free graphs but solvable in polynomial time for ...
متن کاملP5-free augmenting graphs and the maximum stable set problem
The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we 3rst propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied c...
متن کاملPolynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs
In the classic Maximum Weight Independent Set problem we are given a graph G with a nonnegative weight function on vertices, and the goal is to find an independent set in G of maximum possible weight. While the problem is NP-hard in general, we give a polynomial-time algorithm working on any P6-free graph, that is, a graph that has no path on 6 vertices as an induced subgraph. This improves the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014